Depth and breadth relevance in citation metrics

نویسندگان

چکیده

The Euclidean length of a citation list is “depth relevant”: the metric increases when citations are transferred from less to more cited papers. We introduce “breadth relevance,” which favors consistent achievers over one-hit wonders. exponent CES aggregator then than unity rather greater unity, as for depth relevance. Using two datasets on economists top 50 US and global universities, simply counting maximizes correlation between metrics researchers peer-reviewed rank their department. However, may explain allocation across lower-ranked departments.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Breadth, Depth, and Competition

We consider the trade-offs in the choice between depth (a narrow high quality position) and breadth (a wide low quality range). In particular, the extent of depth or breadth in a market can be non-monotonic in the strength of competition.

متن کامل

Breadth and Depth of Semantic Lexicons

Breadth and Depth of Semantic Lexicons is based on a 1996 workshop. It represents several fundamental lines of thinking that were, and remain, a useful organization of the issues in lexical semantics, and specifically in the organization and development of new generations of lexical corpora. The volume contains very useful background discussions of classic issues in lexical semantics (e.g., Eng...

متن کامل

Fairer citation-based metrics

I describe a simple modification which can be applied to any citation count-based index (e.g. Hirsch’s h-index) quantifying a researcher’s publication output. The key idea behind the proposed approach is that the merit for the citations of a paper should be distributed amongst its authors according to their relative contributions. In addition to producing inherently fairer metrics I show that t...

متن کامل

Depth/Breadth first search with applications

Given a graph G = (V,E) and a vertex u ∈ V , we would like to explore every vertex (and every edge) reachable from u. Let n = |V | and m = |E|. The graph may be directed or undirected. We will assume that the graph is given in its adjacency list representation (rather than adjacency matrix), i.e. for each vertex u, we have a linked list adj[u] of the neighbors of u (all vertices v such that (u,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Economic Inquiry

سال: 2021

ISSN: ['0043-3640', '1465-7295', '0095-2583']

DOI: https://doi.org/10.1111/ecin.12994